A search tree is a structuring of a search space into a tree strycture. In some cases this is becasue the problem consists of states and moves so there is a natural tree structure with the start state as root and each possible move as a branch. In other cases where there is a set of paarmeters, the root may be the state with no parameters defined, and each branch fixing the parameters in order; in such cases the order in which the paramters are fixed can substantially affect the efficiency of the search.
Used on Chap. 4: pages 58, 60, 62, 63, 65, 67, 68, 69, 70, 71, 74, 78, 80, 81, 82; Chap. 11: pages 235, 236; Chap. 22: page 539
Also known as tree search
Magic square -- search tree of potential solutions.